Composing Power Series Over a Finite Ring in Essentially Linear Time
نویسندگان
چکیده
منابع مشابه
Composing Power Series Over a Finite Ring in Essentially Linear Time
Applications. The problem of computing f(g), under the restrictions deg f < n and g(0) = 0, is known as order-n power series composition. Here is the point: given power series u and v over R, with v(0) = 0, define f = u(z) mod z and g = v(x) mod x; then f(g) = u(v(x)) mod x. Power series composition is the bottleneck in reversion and iteration of power series. See Brent and Kung (1978) and Knut...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملAutomorphisms of Formal Power Series Rings over a Valuation Ring
The aim of this paper is to report on recent work on liftings of groups of au-tomorphisms of a formal power series ring over a eld k of characteristic p to characteristic 0, where they are realised as groups of automorphisms of a formal power series ring over a suitable valuation ring R dominating the Witt vectors W(k): We show that the lifting requirement for a group of automorphisms places se...
متن کاملThe Complexity of Solving Linear Equations over a Finite Ring
In this paper we first examine the computational complexity of the problem LCON defined as follows: given a matrix A and a column vector b over Z, determine if Ax = b is a feasible system of linear equations over Zq. Here q is also given as part of the input by its prime factorization q = p1 1 p2 2 . . . p ek k , such that each p ei i is tiny (i.e. given in unary). In [MC87] an NC algorithm is ...
متن کاملDetecting perfect powers in essentially linear time
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect power or proves that n is not a perfect power; (3) proves, using Loxton’s theorem on multiple linear forms in logarithms, that this perfect-power decomposition algorithm runs in time (log n)1+o(1).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1998
ISSN: 0747-7171
DOI: 10.1006/jsco.1998.0216